The submodular joint replenishment problem

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The submodular joint replenishment problem

The joint replenishment problem is a fundamental model in supply chain management theory that has applications in inventory management, logistics, and maintenance scheduling. In this problem, there are multiple item types, each having a given time-dependent sequence of demands that need to be satisfied. In order to satisfy demand, orders of the item types must be placed in advance of the due da...

متن کامل

The joint replenishment problem with resource restriction

There are many resource restrictions in real production/inventory systems (for example, budget, storage, transportation capacity, etc.). But unlike other research areas, there is very little research to handle the joint replenishment problem (JRP) with resource restriction. The purpose of this paper is to develop two efficient algorithms for solving these problems. Firstly, we modify the existi...

متن کامل

Approximating the Joint replenishment Problem with Deadlines

The objective of the classical Joint Replenishment Problem (JRP) is to minimize ordering costs by combining orders in two stages, first at some retailers, and then at a warehouse. These orders are needed to satisfy demands that appear over time at the retailers. We investigate the natural special case that each demand has a deadline until when it needs to be satisfied. For this case, we present...

متن کامل

The Joint Replenishment Problem with General Joint Cost Structures

We consider inventory systems with several distinct items. Demands occur at constant, item specific rates. The items are interdependent because of jointly incurred fixed procurement costs: The joint cost structure reflects general economies of scale, merely assuming a monotonicity and concavity (submodularity) property. Under a power-of-two policy each item is replenished with constant reorder ...

متن کامل

The Periodic Joint Replenishment Problem is Strongly NP-Hard

In this paper we study the long-standing open question regarding the computational complexity of one of the core problems in supply chains management, the periodic joint replenishment problem. This problem has received a lot of attention over the years and many heuristic and approximation algorithms were suggested. However, in spite of the vast effort, the complexity of the problem remained unr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Programming

سال: 2015

ISSN: 0025-5610,1436-4646

DOI: 10.1007/s10107-015-0920-3